5 ito a, inoue k, takanami i . a note on alternating turing machines using small space . ieice trans 但是,就我们所知,对于具有较小空间复杂性的交替式下推自动机的研究还很少。
The production line include zc auto washer, gd balanced pressure filer, wfg cap turing machine, ssj carrying machine etc 本生产流水线有zc型自动冲瓶机、gd型等压灌装机、wfg型旋盖机及ssj型输送机等系列产品组成。
13 yoshinaga t, xu j, inoue k . a note on closure property of sublogarithmic space-bounded 1-inkdot alternating turing machines with only existential universal states 例如,关系在关系代数运算下的结果仍为关系,我们称关系集合在关系代数运算下封闭。
Existing complexity proofs on the circularity problem of ags are based on automata theory, such as writing pushdown acceptor and alternating turing machines 目前对属性文法循环性问题复杂度的证明,多基于自动机理论,如写入推出接受器、交替涂林机等。
Lecture notes in computer science 843 . berlin : springer-verlag, 1994, pp . 89-94.8 inoue k, ito a, takanami i . on 1-inkdot alternating turing machines with small space 为了严格地分开确定性语言族和非确定性语言族,ranjan等提出了一个稍加修改的图灵机模型,称为1墨水点1inkdot图灵机。
And yet from a computational standpoint, our automaton still seemed like a self-propelled scooter compared with the rolls-royce of computers on which we had set our sights : the biomolecular turing machine 然而从计算的观点来看,我们的自动机就像人力推进的滑板车一样,而我们的目标,是建造劳斯莱斯级的生物分子涂林机器。
These languages are not necessarily turing-complete if it has a computational power equivalent to a universal turing machine-in other words, the system and the universal turing machine can emulate each other 这些语言不必是图灵完全的(如果它具有与通用图灵机等同的计算能力换句话说,系统和通用图灵机可以相互模拟)。
These languages are not necessarily turing-complete if it has a computational power equivalent to a universal turing machine-in other words, the system and the universal turing machine can emulate each other 这些语言不必是图灵完全的(如果它具有与通用图灵机等同的计算能力换句话说,系统和通用图灵机可以相互模拟)。
In essence, the computational operations of such a turing machine would translate into biomolecular terms as one “ recognition, ” two “ cleavages, ” two “ ligations, ” and a move to the left or right 如果将涂林计算器运作的语言套用在生物分子上的话,将会是一个辨识步骤、两个切割步骤、两个接合步骤,然后向左或向右移动一格。